Rim Hook Lattices

نویسندگان

  • Sergey Fomin
  • Dennis Stanton
چکیده

A partial order is defined on partitions by the removal of rim hooks of a given length. This poset is isomorphic to a product of Young lattices, guaranteeing rim hook versions of Schensted correspondences. Analogous results are given for shifted shapes. 1. Main Results A shape (Young diagram) is a finite order ideal of the lattice P = {(k, l) : k, l ≥ 1}. Shapes form the so-called Young lattice Y (see, e.g., [St86]). An i’th diagonal of a shape λ is the set {(k, l) : l − k = i }. We use the so-called “English notation” for realizing shapes in the 4th quadrant. We denote by #λ the number of boxes in a shape λ. A rim hook is a set of elements (“boxes”) of P which forms a contiguous strip and has at most one box on each diagonal. Throughout the paper a positive integer r is fixed; all of the rim hooks contain exactly r boxes. (Exception: Definition 3.4(3).) *Partially supported by the Mittag-Leffler Institute. **Partially supported by the Mittag-Leffler Institute and by NSF grant #DMS90-01195. 1991 Mathematics Subject Classification. 05A.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rim Hook

We consider the partial order on partitions of integers deened by removal of rim hooks of a given length. The isomorphism between this poset and a product of Young's lattices leads to rim hook versions of Schensted correspondences. Analogous results are given for shifted shapes. A shape, or Young diagram, is a nite order ideal of the lattice P 2 = f(k; l) : k; l 1g. Each shape = f(i; j) : 1 j i...

متن کامل

Edge Sequences, Ribbon Tableaux, and an Action of Affine Permutations

An overview is provided of some of the basic facts concerning rim hook lattices and ribbon tableaux, using a representation of partitions by their edge sequences. An action is defined of the affine Coxeter group of type Ãr−1 on the r-rim hook lattice, and thereby on the sets of standard and semistandard r-ribbon tableaux, and this action is related to the concept of chains in r-ribbon tableaux....

متن کامل

Generalization of the Schensted Algorithm for Rim Hook Tableaux

In [6] Schensted constructed the Schensted algorithm, which gives a bijection between permutations and pairs of standard tableaux of the same shape. Stanton and White [8] gave analog of the Schensted algorithm for rim hook tableaux. In this paper we give a generalization of Stanton and White’s Schensted algorithm for rim hook tableaux. If k is a fixed positive integer, it shows a one-to-one cor...

متن کامل

A Sign-reversing Involution for Rooted Special Rim-hook Tableaux

Eg̃eciog̃lu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define a sign-reversing involution on rooted special rim-hook tableaux which can be used to prove that the last column o...

متن کامل

An algorithmic sign-reversing involution for special rim-hook tableaux

Eğecioğlu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK = I but were unable to do the same for the equation KK = I. We define an algorithmic signreversing involution on rooted special rim-hook tableaux which can be used to prove that the l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014